On condition numbers for Moore-Penrose inverse and linear least squares problem involving Kronecker products

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On condition numbers for Moore-Penrose inverse and linear least squares problem involving Kronecker products

1School of Mathematics and Statistics, Key Laboratory for Applied Statistics of MOE, Northeast Normal University, Chang Chun 130024, China 2School of Mathematical Sciences, Ocean University of China, Qingdao, 266100, China 3School of Mathematical Sciences and Shanghai Key Laboratory of Contemporary Applied Mathematics, Fudan University, Shanghai, 200433, China 4Department of Computing and Softw...

متن کامل

On mixed and componentwise condition numbers for Moore-Penrose inverse and linear least squares problems

Classical condition numbers are normwise: they measure the size of both input perturbations and output errors using some norms. To take into account the relative of each data component, and, in particular, a possible data sparseness, componentwise condition numbers have been increasingly considered. These are mostly of two kinds: mixed and componentwise. In this paper, we give explicit expressi...

متن کامل

On Mixed and Componentwise Condition Numbers for Moore-Penrose Inverse and Linear Least Square Problems

In this talk, we discuss the maximum number of n × n pure imaginary quaternionic solutions to the Hurwitz matrix equations given by T i T * j + T j T Abstract Let T be a bounded linear operator on a complex Hilbert space H. For 0 ≤ q ≤ 1, the

متن کامل

Least squares approximants on Gauss-Lobatto points: orthogonal polynomials and Moore-Penrose pseudo-inverse

Abstract: In this paper we resume some results concerned our work about least-squares approximation on GaussLobatto points. We present explicit formulas for discrete orthogonal polynomials and give the three-term recurrence relation to construct such polynomials. We also show that the normal matrix on this set of nodes can be factorized as the sum of two symmetric matrices: a full rank matrix w...

متن کامل

Condition Numbers for Structured Least Squares Problems

This paper studies the normwise perturbation theory for structured least squares problems. The structures under investigation are symmetric, persymmetric, skewsymmetric, Toeplitz and Hankel. We present the condition numbers for structured least squares. AMS subject classification (2000): 15A18, 65F20, 65F25, 65F50.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerical Linear Algebra with Applications

سال: 2012

ISSN: 1070-5325

DOI: 10.1002/nla.1823